An Efficient Index Mapping Algorithm for OFDM-Index Modulation
نویسندگان
چکیده
منابع مشابه
An Efficient Scheme for PAPR Reduction of OFDM based on Selected Mapping without Side Information
Orthogonal frequency division multiplexing (OFDM) has become a promising method for many wireless communication applications. However, one main drawback of OFDM systems is the high peak-to-average power ratio (PAPR). Selected mapping (SLM) is a well-known technique to decrease the problem of high PAPR in OFDM systems. In this method, transmitter is obliged to send some bits named side informati...
متن کاملAdaptive OFDM Index Modulation for Two-Hop Relay-Assisted Networks
In this paper, we propose an adaptive orthogonal frequency-division multiplexing (OFDM) index modulation (IM) scheme for two-hop relay networks. In contrast to the traditional OFDM IM scheme with a deterministic and fixed mapping scheme, in this proposed adaptive OFDM IM scheme, the mapping schemes between a bit stream and indices of active subcarriers for the first and second hops are adaptive...
متن کاملAn Efficient Algorithm for the 1D Total Visibility-Index Problem
Let T be a terrain, and let P be a set of points (locations) on its surface. An important problem in Geographic Information Science (GIS) is computing the visibility index of a point p on P , that is, the number of points in P that are visible from p. The total visibility-index problem asks for computing the visibility index of every point in P . Most applications of this problem involve 2-dime...
متن کاملAn Efficient Concurrency Control Algorithm for High-Dimensional Index Structures
This chapter introduces a concurrency control algorithm based on link-technique for high-dimensional index structures. In high-dimensional index structures, search operations are generally more frequent than insert or delete operations and need to access many more nodes than those in other index structures, such as B-tree, B-tree, hashing techniques, and so on, due to the properties of queries....
متن کاملAB-Index: An Efficient Adaptive Index for Branching XML Queries
Query-adaptive XML indexing has been proposed and shown to be an efficient way to accelerate XML query processing, because it dynamically adapts to the workload. However, existing adaptive index lack of support for branching queries, and also with low efficiency for query processing and adaptation operations. In this paper, we propose a new Adaptive index for Branching queries, which is named a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2960572